package com.fosss.dijkstra;

/**
 * 迪杰斯特拉法解决最短路径问题（这里的最短路径是指从指定一点分别到其他点各自的最短路径）
 */

public class DijkstraAlgorithm {
    public static void main(String[] args) {
         char[] vertexs={'A','B','C','D','E','F','G'};

         int[][] matrix=new int[vertexs.length][vertexs.length];
         final int N=66535;;

        matrix[0]=new int[]{N,5,7,N,N,N,2};
        matrix[1]=new int[]{5,N,N,9,N,N,3};
        matrix[2]=new int[]{7,N,N,N,8,N,N};
        matrix[3]=new int[]{N,9,N,N,N,4,N};
        matrix[4]=new int[]{N,N,8,N,N,5,4};
        matrix[5]=new int[]{N,N,N,4,5,N,6};
        matrix[6]=new int[]{2,3,N,N,4,6,N};

        Graph graph = new Graph(vertexs, matrix);
        graph.print();

        graph.dijkstraGo(6);//G点
        graph.show();

    }
}



















